./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:47:15,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:47:15,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 04:47:15,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:47:15,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:47:15,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:47:15,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:47:15,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:47:15,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:47:15,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:47:15,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:47:15,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:47:15,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:47:15,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:47:15,567 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:47:15,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:47:15,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:47:15,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 04:47:15,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:47:15,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:47:15,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:47:15,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:47:15,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:47:15,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:47:15,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:47:15,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:47:15,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:47:15,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:47:15,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:47:15,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:47:15,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:47:15,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:47:15,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:47:15,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 04:47:15,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 04:47:15,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:47:15,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:47:15,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:47:15,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:47:15,574 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 [2024-10-24 04:47:15,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:47:15,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:47:15,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:47:15,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:47:15,813 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:47:15,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2024-10-24 04:47:16,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:47:17,139 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:47:17,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2024-10-24 04:47:17,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422045b58/fa1b3e8c7b0749ac8a964afc8a3ca6da/FLAG4bd2cf4ef [2024-10-24 04:47:17,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422045b58/fa1b3e8c7b0749ac8a964afc8a3ca6da [2024-10-24 04:47:17,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:47:17,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:47:17,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:47:17,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:47:17,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:47:17,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62fd2085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17, skipping insertion in model container [2024-10-24 04:47:17,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:47:17,306 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2024-10-24 04:47:17,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:47:17,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:47:17,343 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2024-10-24 04:47:17,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:47:17,372 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:47:17,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17 WrapperNode [2024-10-24 04:47:17,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:47:17,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:47:17,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:47:17,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:47:17,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,420 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 142 [2024-10-24 04:47:17,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:47:17,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:47:17,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:47:17,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:47:17,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,448 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 0 writes are split as follows [0, 0]. [2024-10-24 04:47:17,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:47:17,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:47:17,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:47:17,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:47:17,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (1/1) ... [2024-10-24 04:47:17,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:47:17,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:47:17,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:47:17,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:47:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:47:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 04:47:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 04:47:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:47:17,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:47:17,649 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:47:17,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:47:17,941 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-24 04:47:17,941 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:47:17,967 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:47:17,968 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:47:17,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:47:17 BoogieIcfgContainer [2024-10-24 04:47:17,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:47:17,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:47:17,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:47:17,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:47:17,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:47:17" (1/3) ... [2024-10-24 04:47:17,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7169294e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:47:17, skipping insertion in model container [2024-10-24 04:47:17,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:17" (2/3) ... [2024-10-24 04:47:17,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7169294e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:47:17, skipping insertion in model container [2024-10-24 04:47:17,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:47:17" (3/3) ... [2024-10-24 04:47:17,978 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.seq.c [2024-10-24 04:47:17,991 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:47:17,991 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:47:18,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:47:18,050 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@bbb3eb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:47:18,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:47:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 04:47:18,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:18,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:47:18,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1551217881, now seen corresponding path program 1 times [2024-10-24 04:47:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:47:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516191441] [2024-10-24 04:47:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:47:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:47:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:47:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516191441] [2024-10-24 04:47:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516191441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:47:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:47:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:47:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241784973] [2024-10-24 04:47:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:47:18,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:47:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:47:18,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:47:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:18,474 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:18,506 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-10-24 04:47:18,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:47:18,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 04:47:18,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:18,515 INFO L225 Difference]: With dead ends: 62 [2024-10-24 04:47:18,515 INFO L226 Difference]: Without dead ends: 36 [2024-10-24 04:47:18,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:18,522 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:18,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:47:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-24 04:47:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-24 04:47:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2024-10-24 04:47:18,545 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 14 [2024-10-24 04:47:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:18,546 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2024-10-24 04:47:18,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-10-24 04:47:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 04:47:18,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:18,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:47:18,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 04:47:18,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 844809273, now seen corresponding path program 1 times [2024-10-24 04:47:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:47:18,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939711250] [2024-10-24 04:47:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:47:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:47:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:18,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:47:18,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939711250] [2024-10-24 04:47:18,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939711250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:47:18,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:47:18,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:47:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419345021] [2024-10-24 04:47:18,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:47:18,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:47:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:47:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:47:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:18,689 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:18,722 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2024-10-24 04:47:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:47:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 04:47:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:18,723 INFO L225 Difference]: With dead ends: 65 [2024-10-24 04:47:18,723 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 04:47:18,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:18,725 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:18,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:47:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 04:47:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 04:47:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-10-24 04:47:18,730 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 15 [2024-10-24 04:47:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:18,730 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-10-24 04:47:18,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-10-24 04:47:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 04:47:18,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:18,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:47:18,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 04:47:18,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:18,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash -678682190, now seen corresponding path program 1 times [2024-10-24 04:47:18,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:47:18,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486128417] [2024-10-24 04:47:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:47:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:47:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:47:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486128417] [2024-10-24 04:47:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486128417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:47:18,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:47:18,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:47:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794268559] [2024-10-24 04:47:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:47:18,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:47:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:47:18,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:47:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:18,948 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:18,994 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2024-10-24 04:47:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:47:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 04:47:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:18,996 INFO L225 Difference]: With dead ends: 67 [2024-10-24 04:47:18,996 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 04:47:18,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:47:18,998 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 44 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:18,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 71 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:47:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 04:47:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 04:47:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-10-24 04:47:19,003 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 16 [2024-10-24 04:47:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:19,003 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-10-24 04:47:19,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-10-24 04:47:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 04:47:19,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:19,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:47:19,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 04:47:19,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:19,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1344575456, now seen corresponding path program 1 times [2024-10-24 04:47:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:47:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556236541] [2024-10-24 04:47:19,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:47:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:47:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:47:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556236541] [2024-10-24 04:47:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556236541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:47:19,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:47:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:47:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745880954] [2024-10-24 04:47:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:47:19,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:47:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:47:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:47:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:19,122 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:19,168 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2024-10-24 04:47:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:47:19,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-24 04:47:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:19,169 INFO L225 Difference]: With dead ends: 67 [2024-10-24 04:47:19,169 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 04:47:19,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:47:19,170 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 42 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:19,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:47:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 04:47:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 04:47:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-10-24 04:47:19,175 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 17 [2024-10-24 04:47:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:19,175 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-10-24 04:47:19,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-10-24 04:47:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 04:47:19,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:19,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:47:19,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 04:47:19,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:19,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash -948487473, now seen corresponding path program 1 times [2024-10-24 04:47:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:47:19,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107159258] [2024-10-24 04:47:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:47:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:47:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:47:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107159258] [2024-10-24 04:47:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107159258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:47:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:47:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:47:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261243675] [2024-10-24 04:47:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:47:19,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:47:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:47:19,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:47:19,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:19,304 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:19,332 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2024-10-24 04:47:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:47:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-24 04:47:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:19,333 INFO L225 Difference]: With dead ends: 67 [2024-10-24 04:47:19,333 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 04:47:19,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:47:19,334 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:19,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 77 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:47:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 04:47:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 04:47:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2024-10-24 04:47:19,343 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 18 [2024-10-24 04:47:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:19,343 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2024-10-24 04:47:19,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2024-10-24 04:47:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 04:47:19,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:19,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:47:19,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 04:47:19,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:19,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2068762721, now seen corresponding path program 1 times [2024-10-24 04:47:19,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:47:19,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613034249] [2024-10-24 04:47:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:19,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:47:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:47:19,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:47:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:47:19,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 04:47:19,405 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:47:19,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:47:19,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 04:47:19,409 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 04:47:19,436 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:47:19,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:47:19 BoogieIcfgContainer [2024-10-24 04:47:19,440 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:47:19,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:47:19,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:47:19,441 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:47:19,441 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:47:17" (3/4) ... [2024-10-24 04:47:19,443 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 04:47:19,443 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:47:19,444 INFO L158 Benchmark]: Toolchain (without parser) took 2284.34ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 90.4MB in the beginning and 88.1MB in the end (delta: 2.2MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2024-10-24 04:47:19,444 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:47:19,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.92ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 76.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 04:47:19,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.73ms. Allocated memory is still 167.8MB. Free memory was 76.9MB in the beginning and 136.5MB in the end (delta: -59.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-10-24 04:47:19,445 INFO L158 Benchmark]: Boogie Preprocessor took 38.58ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 04:47:19,445 INFO L158 Benchmark]: RCFGBuilder took 507.60ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 121.6MB in the end (delta: 12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 04:47:19,445 INFO L158 Benchmark]: TraceAbstraction took 1468.93ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 120.8MB in the beginning and 89.2MB in the end (delta: 31.6MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-10-24 04:47:19,445 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 207.6MB. Free memory was 89.2MB in the beginning and 88.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:47:19,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.92ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 76.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.73ms. Allocated memory is still 167.8MB. Free memory was 76.9MB in the beginning and 136.5MB in the end (delta: -59.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.58ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.60ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 121.6MB in the end (delta: 12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1468.93ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 120.8MB in the beginning and 89.2MB in the end (delta: 31.6MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 207.6MB. Free memory was 89.2MB in the beginning and 88.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 68. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 101); [L31] const SORT_4 msb_SORT_4 = (SORT_4)1 << (101 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L36] const SORT_4 var_5 = 1; [L37] const SORT_8 var_9 = 200; [L38] const SORT_1 var_14 = 1; [L39] const SORT_4 var_18 = 0; [L40] const SORT_8 var_23 = 100; [L42] SORT_1 input_2; [L43] SORT_1 input_3; [L45] EXPR __VERIFIER_nondet_uint128() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, var_14=1, var_18=0, var_23=100, var_5=1, var_9=200] [L45] SORT_4 state_6 = __VERIFIER_nondet_uint128() & mask_SORT_4; [L46] EXPR __VERIFIER_nondet_uint128() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, var_14=1, var_18=0, var_23=100, var_5=1, var_9=200] [L46] SORT_4 state_19 = __VERIFIER_nondet_uint128() & mask_SORT_4; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_20_arg_1 = var_18; [L51] state_19 = init_20_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L54] input_2 = __VERIFIER_nondet_uchar() [L55] input_3 = __VERIFIER_nondet_uchar() [L58] SORT_8 var_10_arg_0 = var_9; VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_10_arg_0=200, var_14=1, var_23=100, var_9=200] [L59] EXPR var_10_arg_0 & mask_SORT_8 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L59] var_10_arg_0 = var_10_arg_0 & mask_SORT_8 [L60] SORT_4 var_10 = var_10_arg_0; [L61] SORT_4 var_11_arg_0 = state_6; [L62] SORT_4 var_11_arg_1 = var_10; [L63] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L64] SORT_1 var_15_arg_0 = var_11; [L65] SORT_1 var_15 = ~var_15_arg_0; [L66] SORT_1 var_16_arg_0 = var_14; [L67] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-2, var_23=100, var_9=200] [L68] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L68] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L69] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L69] var_16 = var_16 & mask_SORT_1 [L70] SORT_1 bad_17_arg_0 = var_16; [L71] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 476 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 201 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 04:47:19,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:47:21,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:47:21,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 04:47:21,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:47:21,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:47:21,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:47:21,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:47:21,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:47:21,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:47:21,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:47:21,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:47:21,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:47:21,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:47:21,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:47:21,339 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:47:21,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:47:21,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:47:21,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:47:21,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:47:21,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:47:21,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:47:21,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 04:47:21,343 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 04:47:21,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:47:21,344 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 04:47:21,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:47:21,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:47:21,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:47:21,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:47:21,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:47:21,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:47:21,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:47:21,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:47:21,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:47:21,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:47:21,346 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 04:47:21,346 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 04:47:21,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:47:21,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:47:21,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:47:21,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:47:21,348 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 04:47:21,348 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 [2024-10-24 04:47:21,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:47:21,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:47:21,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:47:21,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:47:21,628 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:47:21,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2024-10-24 04:47:22,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:47:23,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:47:23,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2024-10-24 04:47:23,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78faae22c/846fd479b369487f884c1dc4bd33a4ee/FLAG6906cc1ee [2024-10-24 04:47:23,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78faae22c/846fd479b369487f884c1dc4bd33a4ee [2024-10-24 04:47:23,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:47:23,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:47:23,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:47:23,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:47:23,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:47:23,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582d43e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23, skipping insertion in model container [2024-10-24 04:47:23,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:47:23,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2024-10-24 04:47:23,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:47:23,263 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:47:23,274 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2024-10-24 04:47:23,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:47:23,320 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:47:23,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23 WrapperNode [2024-10-24 04:47:23,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:47:23,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:47:23,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:47:23,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:47:23,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,354 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2024-10-24 04:47:23,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:47:23,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:47:23,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:47:23,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:47:23,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,381 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 0 writes are split as follows [0, 0]. [2024-10-24 04:47:23,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:47:23,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:47:23,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:47:23,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:47:23,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (1/1) ... [2024-10-24 04:47:23,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:47:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:47:23,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:47:23,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:47:23,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:47:23,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 04:47:23,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 04:47:23,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:47:23,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:47:23,526 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:47:23,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:47:23,665 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-24 04:47:23,665 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:47:23,700 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:47:23,704 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:47:23,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:47:23 BoogieIcfgContainer [2024-10-24 04:47:23,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:47:23,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:47:23,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:47:23,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:47:23,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:47:23" (1/3) ... [2024-10-24 04:47:23,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf08aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:47:23, skipping insertion in model container [2024-10-24 04:47:23,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:47:23" (2/3) ... [2024-10-24 04:47:23,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf08aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:47:23, skipping insertion in model container [2024-10-24 04:47:23,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:47:23" (3/3) ... [2024-10-24 04:47:23,712 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.seq.c [2024-10-24 04:47:23,727 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:47:23,727 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:47:23,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:47:23,771 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@783d1a48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:47:23,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:47:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 04:47:23,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:23,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 04:47:23,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:23,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 04:47:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:47:23,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197932604] [2024-10-24 04:47:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:23,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:47:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:47:23,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:47:23,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 04:47:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:47:23,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 04:47:23,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:47:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:24,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 04:47:24,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:47:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197932604] [2024-10-24 04:47:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197932604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:47:24,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:47:24,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:47:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897866723] [2024-10-24 04:47:24,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:47:24,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:47:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:47:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:47:24,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:47:24,103 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:24,158 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-24 04:47:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:47:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 04:47:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:24,166 INFO L225 Difference]: With dead ends: 15 [2024-10-24 04:47:24,166 INFO L226 Difference]: Without dead ends: 9 [2024-10-24 04:47:24,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:47:24,171 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:24,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:47:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-24 04:47:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-24 04:47:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 04:47:24,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 04:47:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:24,193 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 04:47:24,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 04:47:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 04:47:24,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:24,194 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 04:47:24,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 04:47:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:47:24,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:24,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 04:47:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:47:24,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365933371] [2024-10-24 04:47:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:47:24,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:47:24,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:47:24,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:47:24,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 04:47:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:47:24,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 04:47:24,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:47:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:24,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:47:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:25,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:47:25,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365933371] [2024-10-24 04:47:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365933371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:47:25,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:47:25,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 04:47:25,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074420225] [2024-10-24 04:47:25,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:47:25,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:47:25,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:47:25,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:47:25,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:47:25,030 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:25,268 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-24 04:47:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 04:47:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 04:47:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:25,269 INFO L225 Difference]: With dead ends: 17 [2024-10-24 04:47:25,269 INFO L226 Difference]: Without dead ends: 15 [2024-10-24 04:47:25,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-24 04:47:25,270 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:25,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 04:47:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-24 04:47:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-24 04:47:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-24 04:47:25,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-24 04:47:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:25,277 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-24 04:47:25,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-24 04:47:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 04:47:25,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:25,278 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-24 04:47:25,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 04:47:25,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:47:25,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:25,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-24 04:47:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:47:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744157241] [2024-10-24 04:47:25,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 04:47:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:47:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:47:25,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:47:25,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 04:47:25,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 04:47:25,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:47:25,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 04:47:25,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:47:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:25,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:47:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:47:28,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:47:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744157241] [2024-10-24 04:47:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744157241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:47:28,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:47:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-24 04:47:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944760412] [2024-10-24 04:47:28,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:47:28,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 04:47:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:47:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 04:47:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-24 04:47:28,355 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:47:30,824 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-24 04:47:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 04:47:30,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 04:47:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:47:30,827 INFO L225 Difference]: With dead ends: 29 [2024-10-24 04:47:30,827 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 04:47:30,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-10-24 04:47:30,828 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 04:47:30,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 04:47:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 04:47:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-24 04:47:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-24 04:47:30,834 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2024-10-24 04:47:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:47:30,834 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-24 04:47:30,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:47:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-24 04:47:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 04:47:30,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:47:30,835 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2024-10-24 04:47:30,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 04:47:31,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:47:31,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:47:31,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:47:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1505384042, now seen corresponding path program 3 times [2024-10-24 04:47:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:47:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320465132] [2024-10-24 04:47:31,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 04:47:31,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:47:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:47:31,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:47:31,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 04:47:31,115 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 04:47:31,115 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:47:31,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 04:47:31,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:47:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 04:47:32,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:47:49,866 WARN L286 SmtUtils]: Spent 10.69s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)