./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.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 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 17:29:07,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:07,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 17:29:07,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:07,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:07,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:07,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:07,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:07,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:07,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:07,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:07,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:07,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:07,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:07,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:07,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:07,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:07,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:29:07,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:07,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:07,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:07,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:07,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:07,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:07,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:07,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:07,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:07,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:07,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:07,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:07,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:07,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:07,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:07,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:29:07,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:29:07,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:07,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:07,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:07,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:07,380 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 -> 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 [2024-11-08 17:29:07,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:07,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:07,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:07,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:07,593 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:07,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-08 17:29:08,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:08,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:08,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-08 17:29:08,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f41372a0/b7c8874ce5fc40038bef5a7b495458cf/FLAGdd93d6a13 [2024-11-08 17:29:09,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f41372a0/b7c8874ce5fc40038bef5a7b495458cf [2024-11-08 17:29:09,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:09,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:09,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:09,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:09,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:09,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:09,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dacc5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09, skipping insertion in model container [2024-11-08 17:29:09,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:09,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:09,217 WARN L250 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.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-08 17:29:09,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:09,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:09,430 WARN L250 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.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-08 17:29:09,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:09,544 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:09,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09 WrapperNode [2024-11-08 17:29:09,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:09,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:09,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:09,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:09,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:09,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:09,859 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3197 [2024-11-08 17:29:09,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:09,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:09,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:09,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:09,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:09,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:09,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:29:10,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:10,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:10,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:10,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:10,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (1/1) ... [2024-11-08 17:29:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:29:10,304 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-11-08 17:29:10,306 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-11-08 17:29:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:29:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:10,570 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:10,573 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:13,001 INFO L? ?]: Removed 1718 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:13,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:13,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:13,034 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:13,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:13 BoogieIcfgContainer [2024-11-08 17:29:13,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:13,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:13,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:13,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:13,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:09" (1/3) ... [2024-11-08 17:29:13,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260cbec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:13, skipping insertion in model container [2024-11-08 17:29:13,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:09" (2/3) ... [2024-11-08 17:29:13,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260cbec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:13, skipping insertion in model container [2024-11-08 17:29:13,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:13" (3/3) ... [2024-11-08 17:29:13,043 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-08 17:29:13,058 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:13,059 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:13,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:13,126 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;@7acf2998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:13,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 1136 states, 1134 states have (on average 1.5052910052910053) internal successors, (1707), 1135 states have internal predecessors, (1707), 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-11-08 17:29:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 17:29:13,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:13,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:13,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1418999555, now seen corresponding path program 1 times [2024-11-08 17:29:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:13,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812933915] [2024-11-08 17:29:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:13,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812933915] [2024-11-08 17:29:13,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812933915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:13,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:13,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986400014] [2024-11-08 17:29:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:13,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:13,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:13,719 INFO L87 Difference]: Start difference. First operand has 1136 states, 1134 states have (on average 1.5052910052910053) internal successors, (1707), 1135 states have internal predecessors, (1707), 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 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-11-08 17:29:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:13,828 INFO L93 Difference]: Finished difference Result 2205 states and 3317 transitions. [2024-11-08 17:29:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2024-11-08 17:29:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:13,843 INFO L225 Difference]: With dead ends: 2205 [2024-11-08 17:29:13,843 INFO L226 Difference]: Without dead ends: 1135 [2024-11-08 17:29:13,849 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-11-08 17:29:13,851 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 0 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5097 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-11-08 17:29:13,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5097 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-08 17:29:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2024-11-08 17:29:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.5035273368606703) internal successors, (1705), 1134 states have internal predecessors, (1705), 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-11-08 17:29:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1705 transitions. [2024-11-08 17:29:13,913 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1705 transitions. Word has length 59 [2024-11-08 17:29:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:13,913 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1705 transitions. [2024-11-08 17:29:13,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-11-08 17:29:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1705 transitions. [2024-11-08 17:29:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 17:29:13,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:13,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:13,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:29:13,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:13,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1041008749, now seen corresponding path program 1 times [2024-11-08 17:29:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967048810] [2024-11-08 17:29:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967048810] [2024-11-08 17:29:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967048810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:14,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:14,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377113662] [2024-11-08 17:29:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:14,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:14,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:14,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:14,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:14,095 INFO L87 Difference]: Start difference. First operand 1135 states and 1705 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-11-08 17:29:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:14,133 INFO L93 Difference]: Finished difference Result 2206 states and 3315 transitions. [2024-11-08 17:29:14,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:14,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2024-11-08 17:29:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:14,137 INFO L225 Difference]: With dead ends: 2206 [2024-11-08 17:29:14,138 INFO L226 Difference]: Without dead ends: 1137 [2024-11-08 17:29:14,139 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-11-08 17:29:14,140 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 0 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5093 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:14,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5093 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-11-08 17:29:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2024-11-08 17:29:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.5026408450704225) internal successors, (1707), 1136 states have internal predecessors, (1707), 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-11-08 17:29:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1707 transitions. [2024-11-08 17:29:14,158 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1707 transitions. Word has length 60 [2024-11-08 17:29:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:14,158 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1707 transitions. [2024-11-08 17:29:14,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-11-08 17:29:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1707 transitions. [2024-11-08 17:29:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 17:29:14,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:14,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:14,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:29:14,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:14,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1108534556, now seen corresponding path program 1 times [2024-11-08 17:29:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846800335] [2024-11-08 17:29:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:14,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846800335] [2024-11-08 17:29:14,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846800335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:14,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985093453] [2024-11-08 17:29:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:14,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:14,325 INFO L87 Difference]: Start difference. First operand 1137 states and 1707 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-11-08 17:29:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:14,373 INFO L93 Difference]: Finished difference Result 2214 states and 3325 transitions. [2024-11-08 17:29:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:14,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-08 17:29:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:14,378 INFO L225 Difference]: With dead ends: 2214 [2024-11-08 17:29:14,378 INFO L226 Difference]: Without dead ends: 1143 [2024-11-08 17:29:14,380 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-11-08 17:29:14,382 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 4 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5087 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:14,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5087 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-11-08 17:29:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2024-11-08 17:29:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.501751313485114) internal successors, (1715), 1142 states have internal predecessors, (1715), 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-11-08 17:29:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1715 transitions. [2024-11-08 17:29:14,405 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1715 transitions. Word has length 61 [2024-11-08 17:29:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:14,405 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1715 transitions. [2024-11-08 17:29:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-11-08 17:29:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1715 transitions. [2024-11-08 17:29:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 17:29:14,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:14,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:14,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:29:14,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:14,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1058890139, now seen corresponding path program 1 times [2024-11-08 17:29:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:14,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194417251] [2024-11-08 17:29:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194417251] [2024-11-08 17:29:14,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194417251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:14,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:14,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863920804] [2024-11-08 17:29:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:14,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:14,575 INFO L87 Difference]: Start difference. First operand 1143 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-11-08 17:29:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:14,638 INFO L93 Difference]: Finished difference Result 2224 states and 3337 transitions. [2024-11-08 17:29:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:14,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-11-08 17:29:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:14,642 INFO L225 Difference]: With dead ends: 2224 [2024-11-08 17:29:14,642 INFO L226 Difference]: Without dead ends: 1147 [2024-11-08 17:29:14,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:14,644 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 0 mSDsluCounter, 5069 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6770 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:14,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6770 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-11-08 17:29:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1143. [2024-11-08 17:29:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.501751313485114) internal successors, (1715), 1142 states have internal predecessors, (1715), 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-11-08 17:29:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1715 transitions. [2024-11-08 17:29:14,658 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1715 transitions. Word has length 62 [2024-11-08 17:29:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:14,659 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1715 transitions. [2024-11-08 17:29:14,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-11-08 17:29:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1715 transitions. [2024-11-08 17:29:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 17:29:14,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:14,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:14,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:29:14,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:14,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash -625256907, now seen corresponding path program 1 times [2024-11-08 17:29:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631815065] [2024-11-08 17:29:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631815065] [2024-11-08 17:29:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631815065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937392883] [2024-11-08 17:29:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:14,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:14,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:14,852 INFO L87 Difference]: Start difference. First operand 1143 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-11-08 17:29:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:15,805 INFO L93 Difference]: Finished difference Result 3281 states and 4925 transitions. [2024-11-08 17:29:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-08 17:29:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:15,813 INFO L225 Difference]: With dead ends: 3281 [2024-11-08 17:29:15,813 INFO L226 Difference]: Without dead ends: 2204 [2024-11-08 17:29:15,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:15,815 INFO L432 NwaCegarLoop]: 1347 mSDtfsCounter, 1635 mSDsluCounter, 3954 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 5301 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:15,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 5301 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:29:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2024-11-08 17:29:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1174. [2024-11-08 17:29:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.5004262574595055) internal successors, (1760), 1173 states have internal predecessors, (1760), 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-11-08 17:29:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1760 transitions. [2024-11-08 17:29:15,836 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1760 transitions. Word has length 63 [2024-11-08 17:29:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:15,838 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1760 transitions. [2024-11-08 17:29:15,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-11-08 17:29:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1760 transitions. [2024-11-08 17:29:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 17:29:15,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:15,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:15,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:29:15,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:15,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1969110409, now seen corresponding path program 1 times [2024-11-08 17:29:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:15,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197806579] [2024-11-08 17:29:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197806579] [2024-11-08 17:29:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197806579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:16,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76021506] [2024-11-08 17:29:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:16,115 INFO L87 Difference]: Start difference. First operand 1174 states and 1760 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-11-08 17:29:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:16,887 INFO L93 Difference]: Finished difference Result 2266 states and 3398 transitions. [2024-11-08 17:29:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2024-11-08 17:29:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:16,891 INFO L225 Difference]: With dead ends: 2266 [2024-11-08 17:29:16,891 INFO L226 Difference]: Without dead ends: 1189 [2024-11-08 17:29:16,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:16,893 INFO L432 NwaCegarLoop]: 1326 mSDtfsCounter, 1668 mSDsluCounter, 3964 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 5290 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:16,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 5290 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:29:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-11-08 17:29:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1187. [2024-11-08 17:29:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.4966273187183812) internal successors, (1775), 1186 states have internal predecessors, (1775), 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-11-08 17:29:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1775 transitions. [2024-11-08 17:29:16,909 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1775 transitions. Word has length 64 [2024-11-08 17:29:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:16,909 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1775 transitions. [2024-11-08 17:29:16,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-11-08 17:29:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1775 transitions. [2024-11-08 17:29:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:29:16,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:16,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:16,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:29:16,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -593533898, now seen corresponding path program 1 times [2024-11-08 17:29:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957972359] [2024-11-08 17:29:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:16,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:29:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:17,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:29:17,007 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:29:17,008 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:29:17,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:29:17,012 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:17,061 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:29:17,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:29:17 BoogieIcfgContainer [2024-11-08 17:29:17,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:29:17,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:29:17,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:29:17,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:29:17,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:13" (3/4) ... [2024-11-08 17:29:17,069 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:29:17,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:29:17,070 INFO L158 Benchmark]: Toolchain (without parser) took 8047.37ms. Allocated memory was 186.6MB in the beginning and 618.7MB in the end (delta: 432.0MB). Free memory was 157.0MB in the beginning and 151.0MB in the end (delta: 6.0MB). Peak memory consumption was 436.7MB. Max. memory is 16.1GB. [2024-11-08 17:29:17,070 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 132.1MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:29:17,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.78ms. Allocated memory is still 186.6MB. Free memory was 157.0MB in the beginning and 110.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-08 17:29:17,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 313.36ms. Allocated memory is still 186.6MB. Free memory was 110.9MB in the beginning and 82.7MB in the end (delta: 28.2MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-11-08 17:29:17,071 INFO L158 Benchmark]: Boogie Preprocessor took 410.27ms. Allocated memory was 186.6MB in the beginning and 352.3MB in the end (delta: 165.7MB). Free memory was 82.7MB in the beginning and 250.6MB in the end (delta: -167.9MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2024-11-08 17:29:17,072 INFO L158 Benchmark]: RCFGBuilder took 2763.72ms. Allocated memory was 352.3MB in the beginning and 618.7MB in the end (delta: 266.3MB). Free memory was 250.6MB in the beginning and 405.5MB in the end (delta: -154.9MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2024-11-08 17:29:17,073 INFO L158 Benchmark]: TraceAbstraction took 4028.73ms. Allocated memory is still 618.7MB. Free memory was 404.4MB in the beginning and 151.0MB in the end (delta: 253.4MB). Peak memory consumption was 253.4MB. Max. memory is 16.1GB. [2024-11-08 17:29:17,073 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 618.7MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:29:17,075 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.08ms. Allocated memory is still 132.1MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.78ms. Allocated memory is still 186.6MB. Free memory was 157.0MB in the beginning and 110.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 313.36ms. Allocated memory is still 186.6MB. Free memory was 110.9MB in the beginning and 82.7MB in the end (delta: 28.2MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 410.27ms. Allocated memory was 186.6MB in the beginning and 352.3MB in the end (delta: 165.7MB). Free memory was 82.7MB in the beginning and 250.6MB in the end (delta: -167.9MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2763.72ms. Allocated memory was 352.3MB in the beginning and 618.7MB in the end (delta: 266.3MB). Free memory was 250.6MB in the beginning and 405.5MB in the end (delta: -154.9MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4028.73ms. Allocated memory is still 618.7MB. Free memory was 404.4MB in the beginning and 151.0MB in the end (delta: 253.4MB). Peak memory consumption was 253.4MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 618.7MB. Free memory is still 151.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: 21]: 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 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_16 = 0; [L40] const SORT_4 var_39 = 1; [L41] const SORT_4 var_40 = 0; [L42] const SORT_2 var_47 = 1; [L43] const SORT_3 var_49 = 0; [L44] const SORT_4 var_52 = 2; [L45] const SORT_2 var_62 = 0; [L47] SORT_1 input_48; [L48] SORT_1 input_56; [L49] SORT_1 input_63; [L50] SORT_1 input_69; [L51] SORT_1 input_95; [L52] SORT_1 input_99; [L53] SORT_1 input_102; [L54] SORT_1 input_103; [L55] SORT_1 input_109; [L56] SORT_1 input_115; [L57] SORT_1 input_130; [L58] SORT_1 input_148; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L60] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L61] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L62] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L63] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L64] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L65] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L66] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L67] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L68] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L69] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L70] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L71] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L72] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L73] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L74] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L75] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] SORT_2 init_7_arg_1 = var_5; [L78] state_6 = init_7_arg_1 [L79] SORT_2 init_9_arg_1 = var_5; [L80] state_8 = init_9_arg_1 [L81] SORT_2 init_11_arg_1 = var_5; [L82] state_10 = init_11_arg_1 [L83] SORT_2 init_13_arg_1 = var_5; [L84] state_12 = init_13_arg_1 [L85] SORT_2 init_15_arg_1 = var_5; [L86] state_14 = init_15_arg_1 [L87] SORT_1 init_18_arg_1 = var_16; [L88] state_17 = init_18_arg_1 [L89] SORT_1 init_20_arg_1 = var_16; [L90] state_19 = init_20_arg_1 [L91] SORT_1 init_22_arg_1 = var_16; [L92] state_21 = init_22_arg_1 [L93] SORT_1 init_24_arg_1 = var_16; [L94] state_23 = init_24_arg_1 [L95] SORT_1 init_26_arg_1 = var_16; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_28_arg_1 = var_16; [L98] state_27 = init_28_arg_1 [L99] SORT_1 init_30_arg_1 = var_16; [L100] state_29 = init_30_arg_1 [L101] SORT_1 init_32_arg_1 = var_16; [L102] state_31 = init_32_arg_1 [L103] SORT_1 init_34_arg_1 = var_16; [L104] state_33 = init_34_arg_1 [L105] SORT_1 init_36_arg_1 = var_16; [L106] state_35 = init_36_arg_1 [L107] SORT_1 init_38_arg_1 = var_16; [L108] state_37 = init_38_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L111] input_48 = __VERIFIER_nondet_uchar() [L112] input_56 = __VERIFIER_nondet_uchar() [L113] input_63 = __VERIFIER_nondet_uchar() [L114] input_69 = __VERIFIER_nondet_uchar() [L115] input_95 = __VERIFIER_nondet_uchar() [L116] EXPR input_95 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L116] input_95 = input_95 & mask_SORT_1 [L117] input_99 = __VERIFIER_nondet_uchar() [L118] EXPR input_99 & mask_SORT_1 VAL [input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L118] input_99 = input_99 & mask_SORT_1 [L119] input_102 = __VERIFIER_nondet_uchar() [L120] EXPR input_102 & mask_SORT_1 VAL [input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L120] input_102 = input_102 & mask_SORT_1 [L121] input_103 = __VERIFIER_nondet_uchar() [L122] EXPR input_103 & mask_SORT_1 VAL [input_102=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L122] input_103 = input_103 & mask_SORT_1 [L123] input_109 = __VERIFIER_nondet_uchar() [L124] EXPR input_109 & mask_SORT_1 VAL [input_102=0, input_103=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L124] input_109 = input_109 & mask_SORT_1 [L125] input_115 = __VERIFIER_nondet_uchar() [L126] EXPR input_115 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L126] input_115 = input_115 & mask_SORT_1 [L127] input_130 = __VERIFIER_nondet_uchar() [L128] input_148 = __VERIFIER_nondet_uchar() [L131] SORT_1 var_41_arg_0 = state_25; [L132] SORT_4 var_41_arg_1 = var_39; [L133] SORT_4 var_41_arg_2 = var_40; [L134] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L135] SORT_1 var_42_arg_0 = state_35; [L136] SORT_4 var_42_arg_1 = var_39; [L137] SORT_4 var_42_arg_2 = var_40; [L138] SORT_4 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L139] SORT_4 var_43_arg_0 = var_41; [L140] SORT_4 var_43_arg_1 = var_42; [L141] SORT_4 var_43 = var_43_arg_0 + var_43_arg_1; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_43=0, var_47=1, var_49=0, var_52=2, var_62=0] [L142] EXPR var_43 & mask_SORT_4 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L142] var_43 = var_43 & mask_SORT_4 [L143] SORT_4 var_44_arg_0 = var_43; [L144] SORT_4 var_44_arg_1 = var_39; [L145] SORT_1 var_44 = var_44_arg_0 <= var_44_arg_1; [L146] SORT_1 var_45_arg_0 = ~state_37; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_44=1, var_45_arg_0=-1, var_47=1, var_49=0, var_52=2, var_62=0] [L147] EXPR var_45_arg_0 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_44=1, var_47=1, var_49=0, var_52=2, var_62=0] [L147] var_45_arg_0 = var_45_arg_0 & mask_SORT_1 [L148] SORT_1 var_45_arg_1 = ~var_44; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_45_arg_0=1, var_45_arg_1=-2, var_47=1, var_49=0, var_52=2, var_62=0] [L149] EXPR var_45_arg_1 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_45_arg_0=1, var_47=1, var_49=0, var_52=2, var_62=0] [L149] var_45_arg_1 = var_45_arg_1 & mask_SORT_1 [L150] EXPR var_45_arg_0 & var_45_arg_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L150] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L151] EXPR var_45 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L151] var_45 = var_45 & mask_SORT_1 [L152] SORT_1 bad_46_arg_0 = var_45; [L153] CALL __VERIFIER_assert(!(bad_46_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3307 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3307 mSDsluCounter, 32638 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23161 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3023 IncrementalHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 9477 mSDtfsCounter, 3023 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1187occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1036 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-11-08 17:29:17,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.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 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 17:29:18,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:19,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 17:29:19,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:19,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:19,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:19,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:19,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:19,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:19,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:19,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:19,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:19,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:19,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:19,056 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:19,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:19,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:19,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:19,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:19,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:19,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:19,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:29:19,060 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:29:19,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:19,060 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:29:19,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:19,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:19,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:19,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:19,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:19,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:19,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:19,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:19,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:19,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:19,062 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 17:29:19,062 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:29:19,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:19,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:19,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:19,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:19,075 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 -> 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 [2024-11-08 17:29:19,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:19,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:19,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:19,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:19,325 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:19,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-08 17:29:20,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:20,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:20,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-08 17:29:20,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6428b3926/a27b60572b0e4821990be66b06125821/FLAG6aedc59ff [2024-11-08 17:29:21,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6428b3926/a27b60572b0e4821990be66b06125821 [2024-11-08 17:29:21,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:21,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:21,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:21,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:21,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:21,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634a179a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21, skipping insertion in model container [2024-11-08 17:29:21,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:21,330 WARN L250 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.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-08 17:29:21,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:21,499 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:21,508 WARN L250 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.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-08 17:29:21,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:21,591 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:21,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21 WrapperNode [2024-11-08 17:29:21,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:21,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:21,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:21,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:21,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,680 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 921 [2024-11-08 17:29:21,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:21,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:21,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:21,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:21,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,738 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:29:21,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:21,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:21,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:21,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:21,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (1/1) ... [2024-11-08 17:29:21,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:29:21,818 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-11-08 17:29:21,820 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-11-08 17:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:21,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:22,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:22,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:23,571 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:23,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:23,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:23,582 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:23,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:23 BoogieIcfgContainer [2024-11-08 17:29:23,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:23,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:23,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:23,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:23,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:21" (1/3) ... [2024-11-08 17:29:23,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e635b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:23, skipping insertion in model container [2024-11-08 17:29:23,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:21" (2/3) ... [2024-11-08 17:29:23,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e635b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:23, skipping insertion in model container [2024-11-08 17:29:23,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:23" (3/3) ... [2024-11-08 17:29:23,595 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-08 17:29:23,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:23,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:23,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:23,656 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;@73e0d842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:23,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-11-08 17:29:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 17:29:23,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:23,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 17:29:23,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 17:29:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 17:29:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85686826] [2024-11-08 17:29:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:23,679 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-11-08 17:29:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 17:29:23,681 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-11-08 17:29:23,700 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-11-08 17:29:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:23,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 17:29:23,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:24,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:24,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 17:29:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85686826] [2024-11-08 17:29:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85686826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:24,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:24,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:24,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140627771] [2024-11-08 17:29:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:24,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 17:29:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:24,159 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-08 17:29:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:24,514 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 17:29:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:24,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-08 17:29:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:24,521 INFO L225 Difference]: With dead ends: 18 [2024-11-08 17:29:24,521 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 17:29:24,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:24,525 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:24,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 17:29:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 17:29:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-11-08 17:29:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 17:29:24,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 17:29:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:24,545 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 17:29:24,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-08 17:29:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 17:29:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 17:29:24,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:24,545 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:24,549 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 (2)] Ended with exit code 0 [2024-11-08 17:29:24,746 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-11-08 17:29:24,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:24,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 17:29:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 17:29:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817311140] [2024-11-08 17:29:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:24,749 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-11-08 17:29:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 17:29:24,751 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-11-08 17:29:24,752 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-11-08 17:29:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:25,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:29:25,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:29:43,784 INFO L311 TraceCheckSpWp]: Computing backward predicates...