./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:58:05,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:58:05,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 01:58:05,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:58:05,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:58:05,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:58:05,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:58:05,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:58:05,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:58:05,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:58:05,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:58:05,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:58:05,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:58:05,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:58:05,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:58:05,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:58:05,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:58:05,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:58:05,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:58:05,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:58:05,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:58:05,154 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 [2024-11-07 01:58:05,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:58:05,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:58:05,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:58:05,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:58:05,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:58:05,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-07 01:58:06,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:58:07,131 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:58:07,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-07 01:58:07,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dec133dea/315f61ae032741cdace164496fe2088d/FLAG6c6da16ca [2024-11-07 01:58:07,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dec133dea/315f61ae032741cdace164496fe2088d [2024-11-07 01:58:07,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:58:07,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:58:07,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:58:07,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:58:07,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:58:07,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:58:07" (1/1) ... [2024-11-07 01:58:07,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e94b8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:07, skipping insertion in model container [2024-11-07 01:58:07,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:58:07" (1/1) ... [2024-11-07 01:58:07,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:58:07,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-07 01:58:07,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:58:07,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:58:07,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-07 01:58:08,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:58:08,016 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:58:08,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08 WrapperNode [2024-11-07 01:58:08,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:58:08,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:58:08,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:58:08,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:58:08,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:08,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:08,687 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4638 [2024-11-07 01:58:08,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:58:08,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:58:08,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:58:08,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:58:08,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:08,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:08,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,028 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-07 01:58:09,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:58:09,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:58:09,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:58:09,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:58:09,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (1/1) ... [2024-11-07 01:58:09,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:58:09,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:58:09,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:58:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:58:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:58:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:58:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:58:09,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:58:09,762 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:58:09,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:58:14,680 INFO L? ?]: Removed 2538 outVars from TransFormulas that were not future-live. [2024-11-07 01:58:14,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:58:14,736 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:58:14,736 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 01:58:14,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:14 BoogieIcfgContainer [2024-11-07 01:58:14,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:58:14,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:58:14,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:58:14,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:58:14,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:58:07" (1/3) ... [2024-11-07 01:58:14,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da13ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:14, skipping insertion in model container [2024-11-07 01:58:14,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:08" (2/3) ... [2024-11-07 01:58:14,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da13ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:14, skipping insertion in model container [2024-11-07 01:58:14,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:14" (3/3) ... [2024-11-07 01:58:14,746 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-07 01:58:14,759 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:58:14,760 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 01:58:14,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:58:14,864 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;@1dd821cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:58:14,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 01:58:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 1632 states, 1630 states have (on average 1.503680981595092) internal successors, (2451), 1631 states have internal predecessors, (2451), 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-07 01:58:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:58:14,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:14,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:14,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:14,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 456195606, now seen corresponding path program 1 times [2024-11-07 01:58:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:58:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087043334] [2024-11-07 01:58:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:58:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:15,790 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-07 01:58:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:58:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087043334] [2024-11-07 01:58:15,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087043334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:58:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289491030] [2024-11-07 01:58:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:15,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:58:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:58:15,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:58:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:58:15,825 INFO L87 Difference]: Start difference. First operand has 1632 states, 1630 states have (on average 1.503680981595092) internal successors, (2451), 1631 states have internal predecessors, (2451), 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 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-07 01:58:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:16,021 INFO L93 Difference]: Finished difference Result 3169 states and 4763 transitions. [2024-11-07 01:58:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:58:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2024-11-07 01:58:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:16,045 INFO L225 Difference]: With dead ends: 3169 [2024-11-07 01:58:16,049 INFO L226 Difference]: Without dead ends: 1631 [2024-11-07 01:58:16,060 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-07 01:58:16,063 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 0 mSDsluCounter, 4884 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7329 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:58:16,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7329 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:58:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-11-07 01:58:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-11-07 01:58:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1630 states have (on average 1.5024539877300613) internal successors, (2449), 1630 states have internal predecessors, (2449), 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-07 01:58:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2449 transitions. [2024-11-07 01:58:16,162 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2449 transitions. Word has length 79 [2024-11-07 01:58:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:16,162 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2449 transitions. [2024-11-07 01:58:16,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-07 01:58:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2449 transitions. [2024-11-07 01:58:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 01:58:16,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:16,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:58:16,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1258857532, now seen corresponding path program 1 times [2024-11-07 01:58:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:58:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881049971] [2024-11-07 01:58:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:58:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:16,494 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-07 01:58:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:58:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881049971] [2024-11-07 01:58:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881049971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:58:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102888585] [2024-11-07 01:58:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:16,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:58:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:58:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:58:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:58:16,499 INFO L87 Difference]: Start difference. First operand 1631 states and 2449 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-07 01:58:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:16,577 INFO L93 Difference]: Finished difference Result 3170 states and 4761 transitions. [2024-11-07 01:58:16,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:58:16,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2024-11-07 01:58:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:16,588 INFO L225 Difference]: With dead ends: 3170 [2024-11-07 01:58:16,588 INFO L226 Difference]: Without dead ends: 1633 [2024-11-07 01:58:16,591 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-07 01:58:16,592 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 0 mSDsluCounter, 4880 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7325 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-07 01:58:16,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7325 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:58:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-07 01:58:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2024-11-07 01:58:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 1.5018382352941178) internal successors, (2451), 1632 states have internal predecessors, (2451), 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-07 01:58:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2451 transitions. [2024-11-07 01:58:16,627 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2451 transitions. Word has length 80 [2024-11-07 01:58:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:16,629 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2451 transitions. [2024-11-07 01:58:16,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-07 01:58:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2451 transitions. [2024-11-07 01:58:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:58:16,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:16,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:16,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:58:16,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash -728087633, now seen corresponding path program 1 times [2024-11-07 01:58:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:58:16,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654645586] [2024-11-07 01:58:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:58:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:16,905 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-07 01:58:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:58:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654645586] [2024-11-07 01:58:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654645586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:16,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:16,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:58:16,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979251382] [2024-11-07 01:58:16,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:16,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:58:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:58:16,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:58:16,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:58:16,908 INFO L87 Difference]: Start difference. First operand 1633 states and 2451 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-07 01:58:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:16,980 INFO L93 Difference]: Finished difference Result 3174 states and 4765 transitions. [2024-11-07 01:58:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:58:16,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2024-11-07 01:58:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:16,988 INFO L225 Difference]: With dead ends: 3174 [2024-11-07 01:58:16,989 INFO L226 Difference]: Without dead ends: 1635 [2024-11-07 01:58:16,991 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-07 01:58:16,993 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 0 mSDsluCounter, 4874 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7319 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-07 01:58:16,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7319 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:58:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-07 01:58:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2024-11-07 01:58:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1634 states have (on average 1.5012239902080784) internal successors, (2453), 1634 states have internal predecessors, (2453), 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-07 01:58:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2453 transitions. [2024-11-07 01:58:17,034 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2453 transitions. Word has length 81 [2024-11-07 01:58:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:17,034 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2453 transitions. [2024-11-07 01:58:17,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-07 01:58:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2453 transitions. [2024-11-07 01:58:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 01:58:17,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:17,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:17,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:58:17,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:17,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash -186992861, now seen corresponding path program 1 times [2024-11-07 01:58:17,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:58:17,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008563462] [2024-11-07 01:58:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:58:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:17,270 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-07 01:58:17,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:58:17,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008563462] [2024-11-07 01:58:17,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008563462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:17,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:17,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:58:17,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782826944] [2024-11-07 01:58:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:17,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:58:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:58:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:58:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:58:17,274 INFO L87 Difference]: Start difference. First operand 1635 states and 2453 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07 01:58:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:17,345 INFO L93 Difference]: Finished difference Result 3184 states and 4777 transitions. [2024-11-07 01:58:17,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:58:17,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2024-11-07 01:58:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:17,353 INFO L225 Difference]: With dead ends: 3184 [2024-11-07 01:58:17,353 INFO L226 Difference]: Without dead ends: 1643 [2024-11-07 01:58:17,356 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-07 01:58:17,356 INFO L432 NwaCegarLoop]: 2445 mSDtfsCounter, 3 mSDsluCounter, 4874 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 7319 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-07 01:58:17,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 7319 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:58:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-11-07 01:58:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1639. [2024-11-07 01:58:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1638 states have (on average 1.5012210012210012) internal successors, (2459), 1638 states have internal predecessors, (2459), 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-07 01:58:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2459 transitions. [2024-11-07 01:58:17,394 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2459 transitions. Word has length 82 [2024-11-07 01:58:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:17,395 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2459 transitions. [2024-11-07 01:58:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-07 01:58:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2459 transitions. [2024-11-07 01:58:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 01:58:17,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:17,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:17,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:58:17,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash -387617720, now seen corresponding path program 1 times [2024-11-07 01:58:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:58:17,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135088979] [2024-11-07 01:58:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:58:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:17,992 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-07 01:58:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:58:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135088979] [2024-11-07 01:58:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135088979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:58:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460604932] [2024-11-07 01:58:17,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:17,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:58:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:58:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:58:17,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:58:17,995 INFO L87 Difference]: Start difference. First operand 1639 states and 2459 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-07 01:58:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:19,995 INFO L93 Difference]: Finished difference Result 4713 states and 7073 transitions. [2024-11-07 01:58:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:58:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 83 [2024-11-07 01:58:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:20,008 INFO L225 Difference]: With dead ends: 4713 [2024-11-07 01:58:20,008 INFO L226 Difference]: Without dead ends: 3168 [2024-11-07 01:58:20,012 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-07 01:58:20,013 INFO L432 NwaCegarLoop]: 1896 mSDtfsCounter, 2359 mSDsluCounter, 5584 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 7480 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:58:20,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 7480 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:58:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2024-11-07 01:58:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 1682. [2024-11-07 01:58:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 1.5002974419988102) internal successors, (2522), 1681 states have internal predecessors, (2522), 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-07 01:58:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2522 transitions. [2024-11-07 01:58:20,061 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2522 transitions. Word has length 83 [2024-11-07 01:58:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:20,061 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2522 transitions. [2024-11-07 01:58:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-07 01:58:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2522 transitions. [2024-11-07 01:58:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:58:20,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:20,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:20,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:58:20,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:20,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1102737222, now seen corresponding path program 1 times [2024-11-07 01:58:20,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:58:20,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552356617] [2024-11-07 01:58:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:58:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:20,553 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-07 01:58:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:58:20,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552356617] [2024-11-07 01:58:20,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552356617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:20,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:20,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:58:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569696040] [2024-11-07 01:58:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:20,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:58:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:58:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:58:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:58:20,556 INFO L87 Difference]: Start difference. First operand 1682 states and 2522 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-07 01:58:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:22,183 INFO L93 Difference]: Finished difference Result 3242 states and 4862 transitions. [2024-11-07 01:58:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:58:22,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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 84 [2024-11-07 01:58:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:22,190 INFO L225 Difference]: With dead ends: 3242 [2024-11-07 01:58:22,191 INFO L226 Difference]: Without dead ends: 1697 [2024-11-07 01:58:22,193 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-07 01:58:22,196 INFO L432 NwaCegarLoop]: 1877 mSDtfsCounter, 2392 mSDsluCounter, 5617 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 7494 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:58:22,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 7494 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:58:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-11-07 01:58:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1695. [2024-11-07 01:58:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.4976387249114522) internal successors, (2537), 1694 states have internal predecessors, (2537), 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-07 01:58:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2537 transitions. [2024-11-07 01:58:22,233 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2537 transitions. Word has length 84 [2024-11-07 01:58:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:22,234 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2537 transitions. [2024-11-07 01:58:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-07 01:58:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2537 transitions. [2024-11-07 01:58:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 01:58:22,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:22,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:22,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:58:22,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:22,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash 144462281, now seen corresponding path program 1 times [2024-11-07 01:58:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:58:22,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443939511] [2024-11-07 01:58:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:58:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:58:22,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 01:58:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:58:22,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 01:58:22,382 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 01:58:22,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 01:58:22,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:58:22,388 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:22,469 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 01:58:22,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:58:22 BoogieIcfgContainer [2024-11-07 01:58:22,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 01:58:22,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 01:58:22,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 01:58:22,477 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 01:58:22,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:14" (3/4) ... [2024-11-07 01:58:22,479 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 01:58:22,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 01:58:22,481 INFO L158 Benchmark]: Toolchain (without parser) took 15304.50ms. Allocated memory was 100.7MB in the beginning and 503.3MB in the end (delta: 402.7MB). Free memory was 74.9MB in the beginning and 145.4MB in the end (delta: -70.6MB). Peak memory consumption was 337.1MB. Max. memory is 16.1GB. [2024-11-07 01:58:22,481 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:58:22,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.30ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 49.6MB in the end (delta: 25.1MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-11-07 01:58:22,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 669.04ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 49.5MB in the beginning and 90.1MB in the end (delta: -40.5MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2024-11-07 01:58:22,484 INFO L158 Benchmark]: Boogie Preprocessor took 694.04ms. Allocated memory is still 226.5MB. Free memory was 90.1MB in the beginning and 97.0MB in the end (delta: -6.9MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-11-07 01:58:22,484 INFO L158 Benchmark]: RCFGBuilder took 5354.00ms. Allocated memory was 226.5MB in the beginning and 545.3MB in the end (delta: 318.8MB). Free memory was 97.0MB in the beginning and 266.2MB in the end (delta: -169.3MB). Peak memory consumption was 345.0MB. Max. memory is 16.1GB. [2024-11-07 01:58:22,484 INFO L158 Benchmark]: TraceAbstraction took 7737.27ms. Allocated memory was 545.3MB in the beginning and 503.3MB in the end (delta: -41.9MB). Free memory was 266.2MB in the beginning and 145.5MB in the end (delta: 120.7MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2024-11-07 01:58:22,484 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 503.3MB. Free memory was 145.5MB in the beginning and 145.4MB in the end (delta: 80.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 01:58:22,485 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.28ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.30ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 49.6MB in the end (delta: 25.1MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 669.04ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 49.5MB in the beginning and 90.1MB in the end (delta: -40.5MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 694.04ms. Allocated memory is still 226.5MB. Free memory was 90.1MB in the beginning and 97.0MB in the end (delta: -6.9MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. * RCFGBuilder took 5354.00ms. Allocated memory was 226.5MB in the beginning and 545.3MB in the end (delta: 318.8MB). Free memory was 97.0MB in the beginning and 266.2MB in the end (delta: -169.3MB). Peak memory consumption was 345.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7737.27ms. Allocated memory was 545.3MB in the beginning and 503.3MB in the end (delta: -41.9MB). Free memory was 266.2MB in the beginning and 145.5MB in the end (delta: 120.7MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 503.3MB. Free memory was 145.5MB in the beginning and 145.4MB in the end (delta: 80.3kB). Peak memory consumption was 8.4MB. 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 194. 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_20 = 0; [L40] const SORT_4 var_53 = 1; [L41] const SORT_4 var_54 = 0; [L42] const SORT_2 var_63 = 1; [L43] const SORT_3 var_65 = 0; [L44] const SORT_4 var_68 = 3; [L45] const SORT_2 var_72 = 0; [L46] const SORT_4 var_122 = 2; [L47] const SORT_2 var_125 = 2; [L49] SORT_1 input_64; [L50] SORT_1 input_74; [L51] SORT_1 input_76; [L52] SORT_1 input_83; [L53] SORT_1 input_85; [L54] SORT_1 input_92; [L55] SORT_1 input_143; [L56] SORT_1 input_147; [L57] SORT_1 input_150; [L58] SORT_1 input_151; [L59] SORT_1 input_152; [L60] SORT_1 input_153; [L61] SORT_1 input_161; [L62] SORT_1 input_167; [L63] SORT_1 input_173; [L64] SORT_1 input_188; [L65] SORT_1 input_206; [L66] SORT_1 input_224; [L68] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L68] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L69] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L70] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L71] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L72] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L73] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L74] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L75] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L76] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L78] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L79] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L80] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L81] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L82] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L83] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L84] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L85] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L86] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L87] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L88] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L89] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] 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_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L90] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_2 init_7_arg_1 = var_5; [L93] state_6 = init_7_arg_1 [L94] SORT_2 init_9_arg_1 = var_5; [L95] state_8 = init_9_arg_1 [L96] SORT_2 init_11_arg_1 = var_5; [L97] state_10 = init_11_arg_1 [L98] SORT_2 init_13_arg_1 = var_5; [L99] state_12 = init_13_arg_1 [L100] SORT_2 init_15_arg_1 = var_5; [L101] state_14 = init_15_arg_1 [L102] SORT_2 init_17_arg_1 = var_5; [L103] state_16 = init_17_arg_1 [L104] SORT_2 init_19_arg_1 = var_5; [L105] state_18 = init_19_arg_1 [L106] SORT_1 init_22_arg_1 = var_20; [L107] state_21 = init_22_arg_1 [L108] SORT_1 init_24_arg_1 = var_20; [L109] state_23 = init_24_arg_1 [L110] SORT_1 init_26_arg_1 = var_20; [L111] state_25 = init_26_arg_1 [L112] SORT_1 init_28_arg_1 = var_20; [L113] state_27 = init_28_arg_1 [L114] SORT_1 init_30_arg_1 = var_20; [L115] state_29 = init_30_arg_1 [L116] SORT_1 init_32_arg_1 = var_20; [L117] state_31 = init_32_arg_1 [L118] SORT_1 init_34_arg_1 = var_20; [L119] state_33 = init_34_arg_1 [L120] SORT_1 init_36_arg_1 = var_20; [L121] state_35 = init_36_arg_1 [L122] SORT_1 init_38_arg_1 = var_20; [L123] state_37 = init_38_arg_1 [L124] SORT_1 init_40_arg_1 = var_20; [L125] state_39 = init_40_arg_1 [L126] SORT_1 init_42_arg_1 = var_20; [L127] state_41 = init_42_arg_1 [L128] SORT_1 init_44_arg_1 = var_20; [L129] state_43 = init_44_arg_1 [L130] SORT_1 init_46_arg_1 = var_20; [L131] state_45 = init_46_arg_1 [L132] SORT_1 init_48_arg_1 = var_20; [L133] state_47 = init_48_arg_1 [L134] SORT_1 init_50_arg_1 = var_20; [L135] state_49 = init_50_arg_1 [L136] SORT_1 init_52_arg_1 = var_20; [L137] state_51 = init_52_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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L140] input_64 = __VERIFIER_nondet_uchar() [L141] input_74 = __VERIFIER_nondet_uchar() [L142] input_76 = __VERIFIER_nondet_uchar() [L143] input_83 = __VERIFIER_nondet_uchar() [L144] input_85 = __VERIFIER_nondet_uchar() [L145] input_92 = __VERIFIER_nondet_uchar() [L146] input_143 = __VERIFIER_nondet_uchar() [L147] EXPR input_143 & 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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L147] input_143 = input_143 & mask_SORT_1 [L148] input_147 = __VERIFIER_nondet_uchar() [L149] EXPR input_147 & mask_SORT_1 VAL [input_143=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L149] input_147 = input_147 & mask_SORT_1 [L150] input_150 = __VERIFIER_nondet_uchar() [L151] EXPR input_150 & mask_SORT_1 VAL [input_143=0, input_147=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L151] input_150 = input_150 & mask_SORT_1 [L152] input_151 = __VERIFIER_nondet_uchar() [L153] EXPR input_151 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L153] input_151 = input_151 & mask_SORT_1 [L154] input_152 = __VERIFIER_nondet_uchar() [L155] EXPR input_152 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L155] input_152 = input_152 & mask_SORT_1 [L156] input_153 = __VERIFIER_nondet_uchar() [L157] EXPR input_153 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L157] input_153 = input_153 & mask_SORT_1 [L158] input_161 = __VERIFIER_nondet_uchar() [L159] EXPR input_161 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L159] input_161 = input_161 & mask_SORT_1 [L160] input_167 = __VERIFIER_nondet_uchar() [L161] EXPR input_167 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L161] input_167 = input_167 & mask_SORT_1 [L162] input_173 = __VERIFIER_nondet_uchar() [L163] EXPR input_173 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L163] input_173 = input_173 & mask_SORT_1 [L164] input_188 = __VERIFIER_nondet_uchar() [L165] input_206 = __VERIFIER_nondet_uchar() [L166] input_224 = __VERIFIER_nondet_uchar() [L169] SORT_1 var_55_arg_0 = state_29; [L170] SORT_4 var_55_arg_1 = var_53; [L171] SORT_4 var_55_arg_2 = var_54; [L172] SORT_4 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L173] SORT_1 var_56_arg_0 = state_39; [L174] SORT_4 var_56_arg_1 = var_53; [L175] SORT_4 var_56_arg_2 = var_54; [L176] SORT_4 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; [L177] SORT_4 var_57_arg_0 = var_55; [L178] SORT_4 var_57_arg_1 = var_56; [L179] SORT_4 var_57 = var_57_arg_0 + var_57_arg_1; [L180] SORT_1 var_58_arg_0 = state_49; [L181] SORT_4 var_58_arg_1 = var_53; [L182] SORT_4 var_58_arg_2 = var_54; [L183] SORT_4 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L184] SORT_4 var_59_arg_0 = var_57; [L185] SORT_4 var_59_arg_1 = var_58; [L186] SORT_4 var_59 = var_59_arg_0 + var_59_arg_1; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_59=0, var_63=1, var_65=0, var_68=3, var_72=0] [L187] EXPR var_59 & mask_SORT_4 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L187] var_59 = var_59 & mask_SORT_4 [L188] SORT_4 var_60_arg_0 = var_59; [L189] SORT_4 var_60_arg_1 = var_53; [L190] SORT_1 var_60 = var_60_arg_0 <= var_60_arg_1; [L191] SORT_1 var_61_arg_0 = ~state_51; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_60=1, var_61_arg_0=-1, var_63=1, var_65=0, var_68=3, var_72=0] [L192] EXPR var_61_arg_0 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_60=1, var_63=1, var_65=0, var_68=3, var_72=0] [L192] var_61_arg_0 = var_61_arg_0 & mask_SORT_1 [L193] SORT_1 var_61_arg_1 = ~var_60; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_61_arg_0=1, var_61_arg_1=-2, var_63=1, var_65=0, var_68=3, var_72=0] [L194] EXPR var_61_arg_1 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_61_arg_0=1, var_63=1, var_65=0, var_68=3, var_72=0] [L194] var_61_arg_1 = var_61_arg_1 & mask_SORT_1 [L195] EXPR var_61_arg_0 & var_61_arg_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L195] SORT_1 var_61 = var_61_arg_0 & var_61_arg_1; [L196] EXPR var_61 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=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_16=0, state_18=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_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L196] var_61 = var_61 & mask_SORT_1 [L197] SORT_1 bad_62_arg_0 = var_61; [L198] CALL __VERIFIER_assert(!(bad_62_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1632 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4754 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4754 mSDsluCounter, 44266 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30713 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4530 IncrementalHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 13553 mSDtfsCounter, 4530 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred 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.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1492 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 1369 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-07 01:58:22,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:58:24,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:58:24,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 01:58:24,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:58:24,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:58:24,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:58:24,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:58:24,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:58:24,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:58:24,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:58:24,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:58:24,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:58:24,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:58:24,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:58:24,894 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:58:24,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 01:58:24,895 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:58:24,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:58:24,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 01:58:24,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:58:24,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:58:24,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:58:24,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:58:24,897 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 [2024-11-07 01:58:25,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:58:25,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:58:25,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:58:25,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:58:25,209 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:58:25,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-07 01:58:26,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:58:26,846 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:58:26,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-07 01:58:26,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/203d29f63/dea90d8f2c7a4e4b84eb16f92fd2cedc/FLAGf257ec513 [2024-11-07 01:58:26,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/203d29f63/dea90d8f2c7a4e4b84eb16f92fd2cedc [2024-11-07 01:58:26,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:58:26,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:58:26,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:58:26,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:58:26,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:58:26,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:58:26" (1/1) ... [2024-11-07 01:58:26,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71650900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:26, skipping insertion in model container [2024-11-07 01:58:26,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:58:26" (1/1) ... [2024-11-07 01:58:26,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:58:27,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-07 01:58:27,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:58:27,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:58:27,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c[1175,1188] [2024-11-07 01:58:27,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:58:27,569 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:58:27,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27 WrapperNode [2024-11-07 01:58:27,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:58:27,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:58:27,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:58:27,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:58:27,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,702 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1370 [2024-11-07 01:58:27,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:58:27,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:58:27,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:58:27,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:58:27,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,760 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-07 01:58:27,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:58:27,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:58:27,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:58:27,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:58:27,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (1/1) ... [2024-11-07 01:58:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:58:27,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:58:27,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:58:27,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:58:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:58:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 01:58:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:58:27,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:58:28,203 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:58:28,205 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:58:30,640 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-07 01:58:30,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:58:30,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:58:30,648 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 01:58:30,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:30 BoogieIcfgContainer [2024-11-07 01:58:30,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:58:30,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:58:30,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:58:30,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:58:30,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:58:26" (1/3) ... [2024-11-07 01:58:30,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6a9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:30, skipping insertion in model container [2024-11-07 01:58:30,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:58:27" (2/3) ... [2024-11-07 01:58:30,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6a9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:30, skipping insertion in model container [2024-11-07 01:58:30,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:30" (3/3) ... [2024-11-07 01:58:30,659 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c [2024-11-07 01:58:30,674 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:58:30,675 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 01:58:30,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:58:30,732 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;@13882b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:58:30,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 01:58:30,737 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-07 01:58:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 01:58:30,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:30,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 01:58:30,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:30,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 01:58:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:58:30,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751469934] [2024-11-07 01:58:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:30,760 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-07 01:58:30,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:58:30,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-07 01:58:30,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 01:58:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:31,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 01:58:31,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:58:31,492 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-07 01:58:31,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:58:31,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:58:31,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751469934] [2024-11-07 01:58:31,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751469934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:31,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:31,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:58:31,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785260474] [2024-11-07 01:58:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:58:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:58:31,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:58:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:58:31,521 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-07 01:58:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:32,400 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 01:58:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:58:32,402 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-07 01:58:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:32,407 INFO L225 Difference]: With dead ends: 18 [2024-11-07 01:58:32,407 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 01:58:32,409 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-07 01:58:32,412 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:58:32,414 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.8s Time] [2024-11-07 01:58:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 01:58:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 01:58:32,434 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-07 01:58:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 01:58:32,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 01:58:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:32,442 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 01:58:32,442 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-07 01:58:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 01:58:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 01:58:32,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:32,442 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:32,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 01:58:32,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-07 01:58:32,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 01:58:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:58:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747729590] [2024-11-07 01:58:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:32,648 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-07 01:58:32,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:58:32,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-07 01:58:32,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 01:58:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:33,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 01:58:33,495 INFO L278 TraceCheckSpWp]: Computing forward predicates...