./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/hardness-nfm22/hardness_codestructure_dependencies_file-15.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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', '32bit', '--witnessprinter.graph.data.programhash', '6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527'] 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/hardness-nfm22/hardness_codestructure_dependencies_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:53:02,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:53:02,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:53:02,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:53:02,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:53:02,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:53:02,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:53:02,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:53:02,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:53:02,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:53:02,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:53:02,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:53:02,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:53:02,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:53:02,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:53:02,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:53:02,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:02,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:53:02,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:53:02,930 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 [2024-11-07 03:53:03,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:53:03,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:53:03,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:53:03,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:53:03,146 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:53:03,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2024-11-07 03:53:04,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:53:04,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:53:04,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2024-11-07 03:53:04,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/456cf2b43/b3a545e91d154670b8dae617c604bf1f/FLAG949866c1b [2024-11-07 03:53:04,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/456cf2b43/b3a545e91d154670b8dae617c604bf1f [2024-11-07 03:53:04,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:53:04,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:53:04,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:04,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:53:04,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:53:04,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a46109f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04, skipping insertion in model container [2024-11-07 03:53:04,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:53:04,728 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/hardness-nfm22/hardness_codestructure_dependencies_file-15.i[919,932] [2024-11-07 03:53:04,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:04,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:53:04,775 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/hardness-nfm22/hardness_codestructure_dependencies_file-15.i[919,932] [2024-11-07 03:53:04,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:04,808 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:53:04,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04 WrapperNode [2024-11-07 03:53:04,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:04,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:04,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:53:04,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:53:04,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,858 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-07 03:53:04,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:04,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:53:04,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:53:04,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:53:04,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,886 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 03:53:04,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:53:04,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:53:04,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:53:04,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:53:04,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (1/1) ... [2024-11-07 03:53:04,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:04,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:53:04,955 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 03:53:04,962 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 03:53:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:53:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:53:04,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:53:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:53:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:53:04,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:53:05,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:53:05,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:53:05,288 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:53:05,289 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:53:05,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:53:05,300 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:53:05,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:05 BoogieIcfgContainer [2024-11-07 03:53:05,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:53:05,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:53:05,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:53:05,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:53:05,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:53:04" (1/3) ... [2024-11-07 03:53:05,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42770d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:05, skipping insertion in model container [2024-11-07 03:53:05,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:04" (2/3) ... [2024-11-07 03:53:05,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42770d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:05, skipping insertion in model container [2024-11-07 03:53:05,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:05" (3/3) ... [2024-11-07 03:53:05,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-15.i [2024-11-07 03:53:05,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:53:05,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:53:05,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:53:05,372 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;@b6c075e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:53:05,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:53:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 03:53:05,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:05,387 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:05,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:05,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1421208846, now seen corresponding path program 1 times [2024-11-07 03:53:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:05,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856268684] [2024-11-07 03:53:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:53:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 03:53:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 03:53:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 03:53:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:53:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 03:53:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 03:53:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:53:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 03:53:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 03:53:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 03:53:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 03:53:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 03:53:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 03:53:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 03:53:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 03:53:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 03:53:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 03:53:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 03:53:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 03:53:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:05,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:53:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856268684] [2024-11-07 03:53:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856268684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:53:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765544981] [2024-11-07 03:53:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:05,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:53:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:53:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:53:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:53:05,723 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:05,746 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-11-07 03:53:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:53:05,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-07 03:53:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:05,755 INFO L225 Difference]: With dead ends: 121 [2024-11-07 03:53:05,755 INFO L226 Difference]: Without dead ends: 60 [2024-11-07 03:53:05,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:53:05,760 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:05,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:53:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-07 03:53:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-07 03:53:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2024-11-07 03:53:05,804 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 129 [2024-11-07 03:53:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:05,805 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2024-11-07 03:53:05,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-07 03:53:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 03:53:05,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:05,809 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:05,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:53:05,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1269714622, now seen corresponding path program 1 times [2024-11-07 03:53:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56838475] [2024-11-07 03:53:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:53:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 03:53:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 03:53:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 03:53:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:53:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 03:53:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 03:53:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:53:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 03:53:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 03:53:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 03:53:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 03:53:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 03:53:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 03:53:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 03:53:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 03:53:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 03:53:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 03:53:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 03:53:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 03:53:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:53:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56838475] [2024-11-07 03:53:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56838475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:53:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432668268] [2024-11-07 03:53:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:53:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:53:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:53:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:53:06,227 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:06,401 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2024-11-07 03:53:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:53:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-07 03:53:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:06,405 INFO L225 Difference]: With dead ends: 176 [2024-11-07 03:53:06,406 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 03:53:06,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:53:06,407 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 57 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:06,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 243 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:53:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 03:53:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2024-11-07 03:53:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 03:53:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2024-11-07 03:53:06,440 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 129 [2024-11-07 03:53:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2024-11-07 03:53:06,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2024-11-07 03:53:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 03:53:06,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:06,442 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:06,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:53:06,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:06,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2078881433, now seen corresponding path program 1 times [2024-11-07 03:53:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175036265] [2024-11-07 03:53:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:53:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 03:53:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 03:53:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 03:53:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:53:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 03:53:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 03:53:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:53:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 03:53:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 03:53:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 03:53:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 03:53:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 03:53:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 03:53:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 03:53:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 03:53:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 03:53:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 03:53:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 03:53:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 03:53:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:53:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175036265] [2024-11-07 03:53:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175036265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:53:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924025688] [2024-11-07 03:53:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:06,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:53:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:53:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:53:06,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:53:06,771 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:06,929 INFO L93 Difference]: Finished difference Result 248 states and 366 transitions. [2024-11-07 03:53:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:53:06,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 03:53:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:06,932 INFO L225 Difference]: With dead ends: 248 [2024-11-07 03:53:06,932 INFO L226 Difference]: Without dead ends: 191 [2024-11-07 03:53:06,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:53:06,937 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 115 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:06,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 247 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:53:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-07 03:53:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 152. [2024-11-07 03:53:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 94 states have internal predecessors, (116), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 03:53:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-11-07 03:53:06,983 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 130 [2024-11-07 03:53:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:06,984 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-11-07 03:53:06,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-11-07 03:53:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 03:53:06,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:06,985 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:06,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:53:06,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:06,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash -303874071, now seen corresponding path program 1 times [2024-11-07 03:53:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:53:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740693593] [2024-11-07 03:53:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:53:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:53:07,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:53:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:53:07,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:53:07,185 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:53:07,189 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:53:07,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:53:07,193 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 03:53:07,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:53:07,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:53:07 BoogieIcfgContainer [2024-11-07 03:53:07,275 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:53:07,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:53:07,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:53:07,276 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:53:07,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:05" (3/4) ... [2024-11-07 03:53:07,279 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:53:07,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:53:07,280 INFO L158 Benchmark]: Toolchain (without parser) took 2666.31ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 78.3MB in the end (delta: 38.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,281 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 81.5MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:53:07,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.42ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 103.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 101.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:53:07,281 INFO L158 Benchmark]: Boogie Preprocessor took 56.29ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 99.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:53:07,282 INFO L158 Benchmark]: RCFGBuilder took 383.65ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 82.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,282 INFO L158 Benchmark]: TraceAbstraction took 1973.10ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 79.6MB in the end (delta: 2.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-07 03:53:07,283 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 78.3MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:53:07,284 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.22ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 81.5MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.42ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 103.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 101.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.29ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 99.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 383.65ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 82.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1973.10ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 79.6MB in the end (delta: 2.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 78.3MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: 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 someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed char last_1_var_1_10 = -5; [L43] signed long int last_1_var_1_21 = 1; [L44] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_3=162/5, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L128] last_1_var_1_10 = var_1_10 [L129] last_1_var_1_21 = var_1_21 [L130] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_3=162/5, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L93] var_1_3 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L96] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L97] var_1_7 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L99] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L99] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L100] var_1_8 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L101] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L102] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L102] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L103] var_1_9 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L105] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L105] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L106] var_1_11 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L107] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L109] var_1_13 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L110] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L111] var_1_14 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L112] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L113] var_1_15 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L114] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L115] var_1_16 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L116] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L117] var_1_20 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L118] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L119] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L119] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L121] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L122] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L122] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L123] var_1_23 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L124] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L125] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L125] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L49] COND TRUE var_1_11 <= last_1_var_1_25 [L50] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L53] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L54] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L55] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L59] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L66] COND FALSE !(\read(var_1_19)) [L69] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L71] COND TRUE var_1_19 || (var_1_12 > var_1_12) [L72] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L76] COND FALSE !(\read(var_1_20)) [L89] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 302 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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 03:53:07,307 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/hardness-nfm22/hardness_codestructure_dependencies_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:53:09,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:53:09,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 03:53:09,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:53:09,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:53:09,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:53:09,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:53:09,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:53:09,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:53:09,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:53:09,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:53:09,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:53:09,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:53:09,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:53:09,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:53:09,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:53:09,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:53:09,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:53:09,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:53:09,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:53:09,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:53:09,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:53:09,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:53:09,573 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:53:09,573 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:53:09,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:53:09,574 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:53:09,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:53:09,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:53:09,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:53:09,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:53:09,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:53:09,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:53:09,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:53:09,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:09,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:53:09,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:53:09,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:53:09,575 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:53:09,575 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:53:09,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:53:09,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:53:09,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:53:09,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:53:09,576 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 [2024-11-07 03:53:09,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:53:09,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:53:09,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:53:09,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:53:09,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:53:09,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2024-11-07 03:53:11,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:53:11,322 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:53:11,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2024-11-07 03:53:11,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c42c412b0/7da50d28ca7c4491ba9cd4aa933d4a24/FLAGbe7be421d [2024-11-07 03:53:11,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c42c412b0/7da50d28ca7c4491ba9cd4aa933d4a24 [2024-11-07 03:53:11,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:53:11,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:53:11,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:11,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:53:11,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:53:11,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273dd979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11, skipping insertion in model container [2024-11-07 03:53:11,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:53:11,485 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/hardness-nfm22/hardness_codestructure_dependencies_file-15.i[919,932] [2024-11-07 03:53:11,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:11,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:53:11,572 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/hardness-nfm22/hardness_codestructure_dependencies_file-15.i[919,932] [2024-11-07 03:53:11,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:53:11,607 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:53:11,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11 WrapperNode [2024-11-07 03:53:11,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:53:11,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:11,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:53:11,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:53:11,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,646 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-07 03:53:11,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:53:11,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:53:11,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:53:11,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:53:11,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,670 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 03:53:11,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:53:11,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:53:11,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:53:11,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:53:11,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (1/1) ... [2024-11-07 03:53:11,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:53:11,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:53:11,728 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 03:53:11,735 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 03:53:11,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:53:11,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:53:11,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:53:11,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:53:11,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:53:11,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:53:11,843 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:53:11,845 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:53:15,269 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:53:15,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:53:15,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:53:15,276 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:53:15,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:15 BoogieIcfgContainer [2024-11-07 03:53:15,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:53:15,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:53:15,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:53:15,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:53:15,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:53:11" (1/3) ... [2024-11-07 03:53:15,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244bb0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:15, skipping insertion in model container [2024-11-07 03:53:15,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:11" (2/3) ... [2024-11-07 03:53:15,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244bb0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:53:15, skipping insertion in model container [2024-11-07 03:53:15,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:53:15" (3/3) ... [2024-11-07 03:53:15,284 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-15.i [2024-11-07 03:53:15,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:53:15,317 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:53:15,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:53:15,371 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;@24d09dd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:53:15,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:53:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 03:53:15,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:15,385 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:15,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:15,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1421208846, now seen corresponding path program 1 times [2024-11-07 03:53:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:15,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145847942] [2024-11-07 03:53:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:53:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:15,405 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 03:53:15,408 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 03:53:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:15,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 03:53:15,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-07 03:53:15,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:53:15,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:15,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145847942] [2024-11-07 03:53:15,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145847942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:15,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:15,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:53:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499658077] [2024-11-07 03:53:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:15,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:53:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:15,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:53:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:53:15,788 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:15,812 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-11-07 03:53:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:53:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-07 03:53:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:15,818 INFO L225 Difference]: With dead ends: 121 [2024-11-07 03:53:15,818 INFO L226 Difference]: Without dead ends: 60 [2024-11-07 03:53:15,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:53:15,826 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:15,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:53:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-07 03:53:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-07 03:53:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 03:53:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2024-11-07 03:53:15,856 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 129 [2024-11-07 03:53:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:15,856 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2024-11-07 03:53:15,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 03:53:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-07 03:53:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 03:53:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:15,859 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:15,870 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 03:53:16,063 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 03:53:16,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1269714622, now seen corresponding path program 1 times [2024-11-07 03:53:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265410833] [2024-11-07 03:53:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:16,067 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 03:53:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:16,069 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 03:53:16,071 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 03:53:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:16,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 03:53:16,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:17,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:53:17,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265410833] [2024-11-07 03:53:17,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265410833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:17,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:17,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:53:17,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316711431] [2024-11-07 03:53:17,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:17,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:53:17,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:17,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:53:17,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:53:17,454 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:19,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:19,898 INFO L93 Difference]: Finished difference Result 175 states and 265 transitions. [2024-11-07 03:53:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:53:19,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-07 03:53:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:19,920 INFO L225 Difference]: With dead ends: 175 [2024-11-07 03:53:19,920 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 03:53:19,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:53:19,921 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 51 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:19,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 245 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 03:53:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 03:53:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2024-11-07 03:53:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 03:53:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2024-11-07 03:53:19,940 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 129 [2024-11-07 03:53:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:19,940 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2024-11-07 03:53:19,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2024-11-07 03:53:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 03:53:19,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:19,942 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:19,955 INFO L552 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)] Ended with exit code 0 [2024-11-07 03:53:20,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 03:53:20,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:20,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2078881433, now seen corresponding path program 1 times [2024-11-07 03:53:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186821870] [2024-11-07 03:53:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:20,148 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 03:53:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:20,153 INFO L229 MonitoredProcess]: Starting monitored process 4 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 03:53:20,154 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 (4)] Waiting until timeout for monitored process [2024-11-07 03:53:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:20,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 03:53:20,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 03:53:21,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:53:21,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186821870] [2024-11-07 03:53:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186821870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:53:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:53:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:53:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16517989] [2024-11-07 03:53:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:53:21,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:53:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:21,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:53:21,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:53:21,640 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:25,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:27,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 03:53:34,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 03:53:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:35,774 INFO L93 Difference]: Finished difference Result 214 states and 323 transitions. [2024-11-07 03:53:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:53:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 03:53:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:35,790 INFO L225 Difference]: With dead ends: 214 [2024-11-07 03:53:35,790 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 03:53:35,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:53:35,791 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 73 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:35,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-07 03:53:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 03:53:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2024-11-07 03:53:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 03:53:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-11-07 03:53:35,810 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 130 [2024-11-07 03:53:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:35,811 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-11-07 03:53:35,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 03:53:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-11-07 03:53:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 03:53:35,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:35,814 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:35,836 INFO L552 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 (4)] Ended with exit code 0 [2024-11-07 03:53:36,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 03:53:36,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1398823063, now seen corresponding path program 1 times [2024-11-07 03:53:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914644779] [2024-11-07 03:53:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:36,019 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 03:53:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:36,021 INFO L229 MonitoredProcess]: Starting monitored process 5 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 03:53:36,023 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 (5)] Waiting until timeout for monitored process [2024-11-07 03:53:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:36,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 03:53:36,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 336 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-07 03:53:36,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:53:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 03:53:37,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914644779] [2024-11-07 03:53:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914644779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:53:37,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:53:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-07 03:53:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523965705] [2024-11-07 03:53:37,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:53:37,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:53:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:37,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:53:37,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:53:37,644 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-07 03:53:40,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:42,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:45,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:46,407 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2024-11-07 03:53:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 03:53:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 130 [2024-11-07 03:53:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:46,422 INFO L225 Difference]: With dead ends: 233 [2024-11-07 03:53:46,423 INFO L226 Difference]: Without dead ends: 175 [2024-11-07 03:53:46,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2024-11-07 03:53:46,424 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 317 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:46,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 234 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-07 03:53:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-07 03:53:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 108. [2024-11-07 03:53:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 03:53:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-07 03:53:46,471 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 130 [2024-11-07 03:53:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:46,471 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-07 03:53:46,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-07 03:53:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-07 03:53:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 03:53:46,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:46,472 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:46,487 INFO L552 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 (5)] Ended with exit code 0 [2024-11-07 03:53:46,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 03:53:46,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:46,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1272172841, now seen corresponding path program 1 times [2024-11-07 03:53:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:46,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005750495] [2024-11-07 03:53:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:46,674 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 03:53:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:46,680 INFO L229 MonitoredProcess]: Starting monitored process 6 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 03:53:46,682 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 (6)] Waiting until timeout for monitored process [2024-11-07 03:53:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:46,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 03:53:46,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:53:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-07 03:53:47,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:53:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 03:53:47,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:53:47,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005750495] [2024-11-07 03:53:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005750495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:53:47,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:53:47,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 03:53:47,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392162775] [2024-11-07 03:53:47,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:53:47,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:53:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:53:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:53:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:53:47,535 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 03:53:49,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:53:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:53:49,235 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2024-11-07 03:53:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:53:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 131 [2024-11-07 03:53:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:53:49,258 INFO L225 Difference]: With dead ends: 182 [2024-11-07 03:53:49,258 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 03:53:49,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-07 03:53:49,259 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 03:53:49,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 113 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 03:53:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 03:53:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2024-11-07 03:53:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 03:53:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2024-11-07 03:53:49,283 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 131 [2024-11-07 03:53:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:53:49,283 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2024-11-07 03:53:49,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 03:53:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2024-11-07 03:53:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 03:53:49,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:53:49,284 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:49,297 INFO L552 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 (6)] Ended with exit code 0 [2024-11-07 03:53:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 03:53:49,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:53:49,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:53:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1999875417, now seen corresponding path program 1 times [2024-11-07 03:53:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:53:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232361993] [2024-11-07 03:53:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:53:49,486 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 03:53:49,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:53:49,489 INFO L229 MonitoredProcess]: Starting monitored process 7 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 03:53:49,490 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 (7)] Waiting until timeout for monitored process [2024-11-07 03:53:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:53:49,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 03:53:49,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:54:31,622 WARN L286 SmtUtils]: Spent 13.37s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)